package com.structure.tree.binaryTree;

public class BinaryTreeNode {

	private int key; //层序编码
	private Object data;
	private BinaryTreeNode leftTreeNode;
	private BinaryTreeNode rightTreeNode;
	
	public BinaryTreeNode(){
		
	}
	
	public BinaryTreeNode(int key,Object data){
		this.key = key;
		this.data = data;
	}
	
	
	public Object getData() {
		return data;
	}
	public void setData(Object data) {
		this.data = data;
	}
	public BinaryTreeNode getLeftTreeNode() {
		return leftTreeNode;
	}
	public void setLeftTreeNode(BinaryTreeNode leftTreeNode) {
		this.leftTreeNode = leftTreeNode;
	}
	public BinaryTreeNode getRightTreeNode() {
		return rightTreeNode;
	}
	public void setRightTreeNode(BinaryTreeNode rightTreeNode) {
		this.rightTreeNode = rightTreeNode;
	}

	public int getKey() {
		return key;
	}

	public void setKey(int key) {
		this.key = key;
	}
	
	
}
